Evaluation of Distributed Mutual Exclusion through Practical Simulation Maekawa’s Algorithm
نویسنده
چکیده
I implement a simulation engine which measures the practical performance of Maekawa’s permission-based distributed mutual exclusion algorithm. I measure the latency, efficiency, and correctness of the algorithm with varying system load, as well as the number of critical section requests granted out of time stamp order. I lastly report on my own coding techniques employed to construct the engine.
منابع مشابه
Using Maekawa’s Algorithm to Perform Distributed Mutual Exclusion in Quorums
In d istributedsystems,cooperatingprocessesshareboth local and remotersources. Chance isveryhighthatmultipleprocessesmakesimultaneous requests to the same resource. If the resourcerequires mutually exclusive access (critical section CS), thensomeregulation isneeded to access it for ensuring synchronizedaccess of the resources thatonly one process could use the resource at a given time. Th is is...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
In this paper, we present a dynamic information-structure mutual exclusion algorithm for distributed systems whose informationstructure evolves with time as sites learn about the state of the system through messages. An interesting feature of the algorithm is that it adapts itself to heterogeneous or fluctuating traffic conditions to optimize the performance (the number of messages exchanged). ...
متن کاملTechnical Report: KSU-CIS-TR-2011-2 MUTUAL EXCLUSION IN CYBER-PHYSICAL SYSTEMS
Distributed computing problems such as mutual exclusion have been studied extensively for traditional distributed systems. In traditional systems, a strict layered approach is taken wherein a set of users (application processes) U1, . . . ,Un is layered on top of a mutual exclusion algorithm with processes P1, . . . ,Pn. User Ui interacts with process Pi to request access to resources which are...
متن کاملA Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing when a process runs on asynchronous network systems and its timing constraint is so restricted that the process cannot perform a local-spin in a wait-queue, which forces it to abort whenever it cannot access the critic...
متن کامل